Adaptive joint sparse coding-based parallel magnetic resonance imaging method and apparatus and computer readable medium

ABSTRACT

Provided are a parallel magnetic resonance imaging method and apparatus based on adaptive joint sparse codes and a computer-readable medium. The method includes solving an l 2 −l F −l 2,1  minimization objective, where the l 2  norm is a data fitting term, the l F  norm is a sparse representation error, and the l 2,1  mixed norm is the joint sparsity constraining across multiple channels; separately updating each of a sparse matrix, a dictionary and K-space data with a corresponding algorithm, and obtaining a reconstructed image by a sum of root mean squares of all the channels. The joint sparsity of the channels is developed using the norm l 2,1 . In this manner, calibration is not required while information sparsity is developed. Moreover, the method is robust.

CROSS-REFERENCES TO RELATED APPLICATIONS

This is a U.S. National Stage Application, filed under 35 U.S.C. 371, of International Patent Application No. PCT/CN2017/114172, filed on Dec. 1, 2017, the content of which is incorporated herein by reference in its entirety.

TECHNICAL FIELD

The present disclosure relates to a magnetic resonance imaging field and, in particular, to a parallel magnetic resonance imaging method and apparatus based on adaptive joint sparse codes and a computer-readable medium.

BACKGROUND

At present, to improve the speed of magnetic resonance imaging, parallel magnetic resonance imaging based on compressed perceptual is popular. According to the use of sensitivity information, reconstruction methods are divided into three types: accurate calibration, automatic calibration, and calibration-free. In combination with prior information, the calibration-free method has relatively good robustness in terms of sensitivity information. The automatic calibration does not depend on the accurate prediction of sensitivity information. A K-space self-calibration sensitivity method includes generalized auto-calibrating partially parallel acquisitions (GRAPPA) and L1-iterative self-consistent parallel imaging reconstruction (L1-SPIRiT), and the image reconstruction quality of these methods is relatively good. However, as the acceleration multiple increases, the performance of these algorithms decreases. In response to the defect, algorithms such as JSENSE, Sparse BLIP are provided, in which undersampled images can be estimated while the sensitivity information is estimated. However, simultaneous estimation is a nonconvex problem that is sensitive to the initial value of the sensitivity and involves a complex calculation. The calibration-free reconstruction method does not require special calibration information to estimate the sensitivity. The image is reconstructed in a K-space or an image domain through the relation between channels. However, the existing calibration-free reconstruction method utilizes the joint sparsity only in a transformation domain.

SUMMARY

In response to the above problems of the existing art, the present disclosure proposes a method and apparatus for parallel magnetic resonance imaging based on adaptive joint sparse codes. Based on block sparsity, the method and apparatus for parallel magnetic resonance imaging based on adaptive joint sparse codes can improve sparsity, and can ensure the reconstruction quality while further increasing the acceleration multiple.

The present disclosure provides a parallel magnetic resonance imaging method based on adaptive joint sparse codes. The method includes the steps described below.

In step a, a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model is constructed, where the model is defined as the formula described below.

$\begin{matrix} {\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j},f_{j}\ ,D} \right)} = {\underset{V,D,X}{\arg\min}\;{\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX_{l}}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}.}}}} & (1) \end{matrix}$

In the formula, V denotes a reconstructed image, D∈c^(M×P) denotes an overcomplete (P>>M) dictionary, θ denotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(l,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, F_(M) denotes a Fourier transformation, v_(j) denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vectorized size of the image, P denotes a number of atoms, a subscript F denotes the Fourier transformation, λ denotes a data fitting term weight, β denotes a joint sparse regularization weight, and

_(2,1) denotes a joint sparse term.

In the formula, ∥X_(l)∥_(2,1)=Σ_(p=1) ^(p)√{square root over (Σ_(j=1) ^(j)X_(l) _(p) _(,j) ²)}, X_(l) _(p) _(,j) ² denotes a p-th pixel for the l-th extracted patch from the j-th channel image.

In step b, X is temporarily fixed, and the dictionary D is learned by using a gradient descent method.

$\begin{matrix} {D^{k + 1} = {D^{k} - {\gamma{\frac{\partial{\theta(D)}}{\partial(D)}.}}}} & (2) \end{matrix}$

In the formula, γ denotes a learning rate, and k denotes a number of iterations.

$\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ applies, the formula

$\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ denotes a reciprocal of the reconstructed objective function to the dictionary D, and H denotes conjugate transpose.

Therefore, the formula is obtained as below. D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3).

In step c, the joint sparse coefficient X is updated.

In step d, v_(j) is updated by using the formula described as below.

$\begin{matrix} {v_{j}^{k + 1} = {{\theta\left( {X^{k + 1},v_{j},f_{j}^{k}} \right)} = {\underset{v_{j}}{\arg\min}{\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}{\sum\limits_{j = 1}^{J}\left( {{{R_{l}V} - {DX_{l}}}}_{F}^{2} \right)}}} \right\}.}}}} & (4) \end{matrix}$

In step e, the K-space data is updated by using the formula described as below. f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5).

f_(j) ^(k) denotes a updated value of the k-th iteration of the j-th channel.

In step f, K-space data is subjected to an inverse Fourier transformation, and v_(j) is re-updated so that the formula is obtained as below. v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6).

In step g, an updated image is obtained based on the images v_(j) of the all channels.

Preferably, in step a, constructing the reconstructed model is solving an

₂−

_(F)−

_(2,1) minimization objective, where the l₂ norm is a data fitting term, the is norm a sparse representation error, and the l_(2,1) mixed norm is the joint sparsity constraining across multiple channels.

Preferably, step a includes initializing X⁰, V₀, f_(j) ⁰.

Preferably, in step b, the atoms are normalized so that atomic scale ambiguity of the dictionary is avoided.

Preferably, in step d, updating v_(j) further includes the steps described below.

In step d1, according to a method of least squares, the formula is obtained as below.

$\begin{matrix} {{\left( {{{\lambda F}_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}DX_{l,j}^{k + 1}}}}.}} & (7) \end{matrix}$

In the formula,

$\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$ denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations. It is assumed that patches wrap around at the image boundaries, the diagonal entries become all equal

${\sum\limits_{1 = 1}^{L}{R_{1}^{T}R_{1}}} = {{\omega I_{N}} \in {R^{N \times N}.}}$ Specifically, when the overlap stride is 1 for the patches, ω=M.

In step d2, by a normalized full-sampling Fourier encoding matrix, an image domain is transformed into a Fourier domain so that the formula is obtained as below.

$\begin{matrix} {{\left( {{\lambda FF_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right)Fv_{j}} = {{\lambda FF_{M}^{H}f_{j}} + {F{\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}DX_{l,j}^{k + 1}}} \right).}}}} & (8) \end{matrix}$

In the formula, FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix of consisting of ones and zeros with ones corresponding to sampled locations in K-space, ω denotes the number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel.

In step d3, the formula in step d2 is transformed into the formula described as below.

$\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ {\frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {\eta{{\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}}{\eta + 1},} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix}.} \right.} & (9) \end{matrix}$

In the formula, Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space location (k_(x),k_(γ)), and

₀=FF_(M) ^(H)f_(j) denotes a zero-filled K-space measured value of the j-th channel; η denotes a small scalar, Ω denotes a subset of the K-space that has been sampled,

${{{\mathbb{F}} = \frac{F\left( {\sum\limits_{l = 1}^{L}{R_{1}^{T}DX_{{1 = l},j}^{k + 1}}} \right)}{\omega}},{and}}{\eta = {\frac{\lambda}{\omega}.}}$

In step d4, v_(j) is obtained by the inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.

Preferably, in step g, squares of the images v_(j) of the all channels are summed up and a root operation is performed on the sum so that the updated image is obtained.

Another aspect of the present disclosure provides a parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes includes a model construction module, an update module, and an imaging module. The model construction module is configured to construct a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model, where the model is defined as the formula described below.

$\begin{matrix} {\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j},f_{j},D} \right)} = {\underset{V,D,X}{\arg\min}{\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX}_{l}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}.}}}} & (1) \end{matrix}$

In the formula, V denotes a reconstructed image, Dξc^(M×P) denotes an overcomplete (P>>M) dictionary, θ denotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(l,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, F_(M) denotes a Fourier transformation, v_(j) denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vetorized size of the image, P denotes a number of the atoms, a subscript F denotes the Fourier transformation, λ denotes a data fitting term weight, β denotes a joint sparse regularization weight, and

_(2,1) denotes a joint sparse term.

In the formula ∥X_(l)∥_(2,1)=Σ_(p=1) ^(p)√{square root over (Σ_(j=1) ^(j)X_(l) _(p) _(,j) ²)}, X_(l) _(p) _(,j) ² denotes a p-th pixel for the l-th extracted patch from the j-th channel image.

The update module includes a module for updating the joint sparse codes X, a module for updating the dictionary D, a module for updating the image v_(j) of the each channel, and a module for updating the K-space data f_(j).

The module for updating the dictionary D temporarily is configured to fix X, and learn the dictionary D by using a gradient descent method.

$\begin{matrix} {D^{k + 1} = {D^{k} - {\gamma{\frac{{\partial\theta}(D)}{\partial(D)}.}}}} & (2) \end{matrix}$

In the formula, γ denotes a learning rate, and k denotes a number of iterations.

$\frac{{\partial\theta}(D)}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ applies, the formula

$\frac{{\partial\theta}(D)}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ denotes a reciprocal of the reconstructed objective function to the dictionary D, and H denotes conjugate transpose.

Therefore, the formula is obtained as below. D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3).

The module for updating the image v_(j) of the each channel is configured to update v_(j) by using the formula described as below.

v j k + 1 = θ ⁢ ( X k + 1 , v j , f j k ) = arg ⁢ min v j ⁢ { λ 2 ⁢ ∑ j = 1 J  F M ⁢ v j - f j  + ∑ l = 1 L ∑ j = 1 J (  R l ⁢ V - D ⁢ X l  F 2 ) } . ( 4 )

The module for updating the K-space data f_(j) is configured to update the K-space data by using the formula described as below. f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5).

f_(j) ^(k) denotes a k-th iterative updated value of the j-th channel.

The module for updating the image v_(j) of the each channel is further configured to perform an inverse Fourier transformation on the K-space data and re-update v_(j) to obtain the formula described as below. v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6).

The imaging module is configured to obtain an updated image based on the images v_(j) of the all channels.

Preferably, the parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes further includes an initialization module for initializing X⁰, V⁰, f_(j) ⁰.

Preferably, constructing the reconstructed model is constructed is solving an

₂−

_(F)−

_(2,1) minimization objective, where the

₂ norm is a data fitting term, the

_(F) norm is a sparse representation error, and the

_(2,1) mixed norm is the joint sparsity constraining across multiple channels.

Preferably, the update module is configured to perform normalization processing on the atoms while updating the dictionary D so as to avoid atomic scale ambiguity of the dictionary.

Preferably, the module for updating the image v_(j) of the each channel is further configured to perform the steps described below.

In step d1, according to a method of least squares, the formula is obtained as below.

$\begin{matrix} {{\left( {{\lambda F_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}D{X_{l,j}^{k + 1}.}}}}} & (7) \end{matrix}$

In the formula,

$\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$ denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations. It is assumed that patches wrap around at the image boundaries, the diagonal entries become all equal

${\sum\limits_{1 = 1}^{L}{R_{1}^{T}R_{1}}} = {{\omega I_{N}} \in {R^{N \times N}.}}$ Specifically, when the overlap stride is 1 for the patches, ω=M.

In step d2, by a normalized full-sampling Fourier encoding matrix, an image domain is transformed into a Fourier domain so that the formula is obtained as below.

$\begin{matrix} {{{\left( {{\lambda FF_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right)Fv_{j}} = {{\lambda FF_{M}^{H}f_{j}} + {F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}DX_{l,j}^{k + 1}}} \right)}}}.} & (8) \end{matrix}$

In the formula, FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix of consisting of ones and zeros with ones corresponding to sampled locations in K-space, ω denotes a number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel.

In step d3, the formula in step d2 is transformed into the formula described as below.

$\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ \frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {\eta{{\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}}{\eta + 1} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix}.}\  \right.} & (9) \end{matrix}$

In the formula, Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space position (k_(x),k_(γ)), and

₀=FF_(M) ^(H)f_(j) denotes a zero-filled K-space measured value of the j-th channel; η denotes a small scalar, Ω denotes a subset of the K-space that has been sampled,

${{{\mathbb{F}} = \frac{F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{T}DX_{l,j}^{k + 1}}} \right)}{\omega}},{and}}{\eta = {\frac{\lambda}{\omega}.}}$

In step d4, v_(j) is obtained by the inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.

Preferably, the imaging module is configured to sum up squares of the images v_(j) of the all channels and perform a root operation on the sum to obtain the updated image.

The present disclosure provides a computer-readable medium storing a program executable by a computer to cause the computer to perform the steps of the method for parallel magnetic resonance imaging based on adaptive joint sparse codes described above.

Advantageous Effects

In the method of the present disclosure, the joint sparsity of the channels is developed using the

_(2,1) norm. In this manner, calibration is not required while information sparsity is developed. Moreover, the method is robust.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a flowchart of a parallel magnetic resonance imaging method based on adaptive joint sparse codes according to the present disclosure.

FIG. 2 is a block diagram of a parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes according to the present disclosure.

DETAILED DESCRIPTION

In the following description, many specific details are presented to provide a thorough understanding of the present disclosure. The present disclosure may be implemented without some or all of these specific details. In other cases, to avoid causing unnecessary confusion to the present disclosure, the well-known process operations are not detailed. Although the present disclosure will be described in conjunction with embodiments, it should be understood that these embodiments are not intended to limit the present disclosure.

According to FIG. 1 , a parallel magnetic resonance imaging method based on adaptive joint sparse codes provided by one embodiment of the present disclosure is described in detail.

In step a, a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model is constructed, where the model is defined as the formula described below.

$\begin{matrix} {\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j},f_{j},D} \right)} = {\underset{V,D,X}{\arg\min}{\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX}_{l}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}.}}}} & (1) \end{matrix}$

In the formula, V denotes a reconstructed image, D∈c^(M×P) denotes an overcomplete (P>>M) dictionary, θ denotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(i,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, F_(M) denotes a Fourier transformation, v_(j) denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vetorized size of the image, P denotes a number of atoms, a subscript F denotes the Fourier transformation, λ denotes a data fitting term weight, β denotes a joint sparse regularization weight, and

_(2,1) denotes a joint sparse term.

In the formula ∥X_(l)∥_(2,1)=Σ_(p=1) ^(p)√{square root over (Σ_(j=1) ^(j)X_(l) _(p) _(,j) ²)}, X_(l) _(p) _(,j) ² denotes a p-th pixel for the l-th extracted patch from the j-th channel image.

In step a, constructing the reconstructed model is solving an

₂−

_(F)−

_(2,1) minimization objective, where the

₂ norm is a data fitting term, the

_(F) norm is a sparse representation error, and the

_(2,1) mixed norm is the joint sparsity constraining across multiple channels.

In step b, X is temporarily fixed, and the dictionary D is learned by using a gradient descent method.

$\begin{matrix} {D^{k + 1} = {D^{k} - {\gamma{\frac{{\partial\theta}(D)}{\partial(D)}.}}}} & (2) \end{matrix}$

In the formula, γ denotes a learning rate, and k denotes a number of iterations.

$\frac{{\partial\theta}(D)}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ applies, the formula

$\frac{{\partial\theta}(D)}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ denotes a reciprocal of the reconstructed objective function to the dictionary D, and H denotes conjugate transpose. Therefore, the formula is obtained as below. D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3).

In step b, normalization processing is performed on the atoms so that atomic scale ambiguity of the dictionary is avoided.

In step c, the joint sparse coefficient X is updated until the number of inner iterations reaches a specific number of times.

$X_{l,j}^{{k + 1},{q + 1}} = {{Jsoftshrinkage}{\left( {B_{l,j}^{q}\ ,\frac{\beta}{2\alpha}} \right).}}$

q denotes the number of times of a layer of loop nested in an inner loop, B denotes an auxiliary variable, and α denotes an auxiliary parameter.

In step d, the image of the each channel is updated by using the formula described as below.

$\begin{matrix} {v_{j}^{k + 1} = {{\theta\left( {X^{k + 1},v_{j},f_{j}^{k}} \right)} = {\underset{v_{j}}{\arg\min}{\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}{\sum\limits_{j = 1}^{J}\left( {{{R_{l}V} - {DX_{l}}}}_{F}^{2} \right)}}} \right\}.}}}} & (4) \end{matrix}$

In step d, updating v_(j) further includes the steps described below.

In step d1, according to a method of least squares, the formula is obtained as below.

$\begin{matrix} {{\left( {{\lambda F_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}D{X_{l,j}^{k + 1}.}}}}} & (7) \end{matrix}$

In the formula,

$\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$ denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations. It is assumed that patches wrap around at the image boundaries, the diagonal entries become all equal

${\sum\limits_{1 = 1}^{L}{R_{1}^{T}R_{1}}} = {{\omega I_{N}} \in {R^{N \times N}.}}$ Specifically, when the overlap stride is 1 for the patches, ω=M.

In step d2, by a normalized full-sampling Fourier encoding matrix, an image domain is transformed into a Fourier domain so that the formula is obtained as below.

$\begin{matrix} {{\left( {{\lambda FF_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right)Fv_{j}} = {{\lambda FF_{M}^{H}f_{j}} + {F{\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}DX_{l,j}^{k + 1}}} \right).}}}} & (8) \end{matrix}$

In the formula, FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix consisting of ones and zeros with ones corresponding to sampled locations in K-space, ω denotes the number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel.

In step d3, the formula in step d2 is transformed into the formula described as below.

$\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ \frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {\eta{{\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}}{\eta + 1} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix}.}\  \right.} & (9) \end{matrix}$

In the formula, Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space position (k_(x),k_(γ)), and

₀=FF_(M) ^(HL)f_(j) denotes a zero-filled K-space measured value of the j-th channel; η denotes a small scalar, Ω denotes a subset of the K-space that has been sampled,

${{\mathbb{F}} = \frac{F\left( {\sum\limits_{1 = 1}^{L}{R_{1}^{T}{DX}_{1,j}^{k + 1}}} \right)}{\omega}},{{{and}\mspace{14mu}\eta} = {\frac{\lambda}{\omega}.}}$

In step d4, v_(j) is obtained by an inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.

In step e, the K-space data is updated by using the formula described as below. f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5).

f_(j) ^(k) denotes a updated value of the k-th iteration of the j-th channel.

In step f, the inverse Fourier transformation is performed on the K-space data and v_(j) is re-updated so that the formula is obtained as below. v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6).

In step g, squares of the images v_(j) of the all channels are summed up and a root operation is performed on the sum so that the updated image is obtained.

In the existing parallel magnetic resonance imaging method, two-dimensional random undersampling is generally utilized. This sampling mode causes noise-like artifacts and loss and blurring of details in the image of a direct inverse Fourier transformation. In the method provided by the present disclosure, high-quality magnetic resonance image reconstruction accelerated to four times is achieved through an overall model and algorithm. Specifically, the joint sparse norm can well inhibit the noise, the structural information of the image can be adaptively acquired through updating of the dictionary, and the reconstruction quality with the minimum error can be achieved by using the accurate iterative loop solution of the overall algorithm.

Furthermore, the present disclosure further provides a computer-readable medium storing a program executable by a computer to cause the computer to perform the processings including the steps described above.

The present disclosure further provides a parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes, which is configured to perform the methods described above. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes includes different modules, which are configured to perform the steps mentioned in the methods described above.

The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes provided by one embodiment of the present disclosure is described according to FIG. 2 . For example, the apparatus includes a model construction module, an update module, and an imaging module. The model construction module is configured to construct a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model. The update module includes a module for updating the joint sparse codes X, a module for updating the dictionary D, a module for updating the image v_(j) of the each channel, and a module for updating the K-space data f_(j). The imaging module is configured to obtain an updated image based on the images v_(j) of the all channels. Preferably, the parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes further includes an initialization module for initializing X⁰, V⁰, f_(j) ⁰.

In the model construction module, constructing the reconstructed model is solving an

₂−

_(F)−

_(2,1) minimization objective, where the

₂ norm is a data fitting term, the

_(F) norm is a sparse representation error, and the

_(2,1) mixed norm is the joint sparsity constraining across multiple channels.

Preferably, the update module is configured to perform normalization processing on the atoms while updating the dictionary D so as to avoid atomic scale ambiguity of the dictionary.

Preferably, the imaging module is configured to sum up squares of the images v_(j) of the all channels and perform a root operation on the sum to obtain the updated image.

Although the present disclosure is described through the preferred embodiments, modifications, permutations and various equivalent substitutions are possible within the scope of the present disclosure. It is also to be noted that there are many alternative ways of implementing the method and system of the present disclosure. Therefore, the appended claims are intended to be construed to include all the modifications, permutations and various equivalent substitutions within the spirit and scope of the present disclosure. 

What is claimed is:
 1. A parallel magnetic resonance imaging method based on adaptive joint sparse codes, applied by a parallel magnetic resonance imaging apparatus, comprising: step a: constructing a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model, wherein the model is defined as: $\begin{matrix} {{\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j}\ ,f_{j}\ ,D} \right)} = {\underset{V,D,X}{\arg\min}\;\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}}\  - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX}_{l}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}}}},} & (1) \end{matrix}$ wherein V denotes a reconstructed image, D∈c^(M×P) denotes an overcomplete (P>>M) dictionary, θ denotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(l,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, F_(M) denotes a Fourier transformation, v_(j) denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vectorized size of the image, P denotes a number of atoms, a subscript F denotes the Fourier transformation, λ denotes a data fitting term weight, β denotes a joint sparse regularization weight, and ∥X_(l)∥_(2,1) denotes a joint sparse term, and wherein ${{X_{l}}_{2,1} = {\sum\limits_{p = 1}^{p}\sqrt{\sum\limits_{j = 1}^{j}X_{l_{p},j}^{2}}}},$  wherein X_(l) _(p) _(,j) ², denotes a p-th pixel for the l-th extracted patch from the j-th channel image; step b: temporarily fixing X, and solving the dictionary D by using a gradient descent method: $\begin{matrix} {{D^{k + 1} = {D^{k} - {\gamma\frac{\partial{\theta(D)}}{\partial(D)}}}},} & (2) \end{matrix}$ wherein γdenotes a learning rate, and k denotes a number of iterations, and wherein $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$  applies, wherein the formula $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$  denotes a reciprocal of the reconstructed objective function to the dictionary D and H denotes conjugate transpose, and thus the following formula is obtained: D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3); step c: updating joint sparse coefficient X; step d: updating v_(j) by using the following formula: $\begin{matrix} {{v_{j}^{k + 1} = {{\theta\left( {X^{k + 1},v_{j},f_{j}^{k}} \right)} = {\underset{v_{j}}{argmin}\;\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}}\  - f_{j}}}}} + {\sum\limits_{l = 1}^{L}{\sum\limits_{j = 1}^{J}\left( {{{R_{l}V} - {DX}_{l}}}_{F}^{2} \right)}}} \right\}}}};} & (4) \end{matrix}$ step e: updating the K-space data by using the following formula: f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5), wherein f_(j) ^(k) denotes an updated value of a k-th iteration of the j-th channel; step f: performing an inverse Fourier transformation on the K-space data and re-updating v_(j) to obtain the following formula: v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6); and step g: obtaining an updated image based on the images v_(j) of the all channels.
 2. The method of claim 1, wherein in step a, constructing the reconstructed model is solving an 1₂−1_(F)−1_(2,1) minimization objective, wherein the 1₂ norm is a data fitting term, the 1_(F) norm is a sparse representation error, and the 1_(2,1) mixed norm is a joint sparsity constraining across multiple channels.
 3. The method of claim 1, wherein step a comprises a step of initializing X⁰, V₀, f_(j) ⁰.
 4. The method of claim 1, wherein in step b, the atoms are normalized so that atomic scale ambiguity of the dictionary is avoided.
 5. The method of claim 1, wherein in step d, updating v_(j) further comprises: step d1: according to a least square method, obtaining the following formula: $\begin{matrix} {{{\left( {{\lambda F_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}{DX}_{l,j}^{k + 1}}}}},} & (7) \\ {{wherein}\mspace{14mu}{\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} & \; \end{matrix}$ wherein $\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$  denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations, assuming that patches wrap around image boundaries, the ${{\sum\limits_{1 = 1}^{L}{R_{1}^{T}R_{1}}} = {{\omega I_{N}} \in R^{N \times N}}},$  diagonal entries become all equal specifically, when the overlap stride is 1 for the patches, ω=M; step d2: by a normalized full-sampling Fourier encoding matrix, transforming an image domain into a Fourier domain to obtain the following formula: $\begin{matrix} {{{\left( {{\lambda\;{FF}_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right)Fv_{j}} = {{\lambda\;{FF}_{M}^{H}f_{j}} + {F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}DX_{l,j}^{k + 1}}} \right)}}},} & (8) \end{matrix}$ wherein FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix consisting of ones and zeros with ones corresponding to sampled locations in K-space, ω denotes a number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel; step d3: transforming the formula in step d2 into: $\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ {\frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {\eta\;{{\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}}{\eta + 1},} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix},} \right.} & (9) \end{matrix}$ wherein Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space position (k_(x),k_(γ)), and

₀=FF_(M) ^(H)f_(j) denotes a zero-filled K-space measured value of the j-th channel; ηdenotes a small scalar, Ωdenotes a subset of the K-space that has been sampled, ${{\mathbb{F}} = \frac{F\left( {\sum\limits_{1 = 1}^{L}{R_{1}^{T}{DX}_{1,j}^{k + 1}}} \right)}{\omega}},{{{{and}\mspace{14mu}\eta} = \frac{\lambda}{\omega}};}$  and step d4: obtaining v_(j) by the inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.
 6. The method of claim 1, wherein in step g, squares of the images v_(j) of the all channels are summed up and a root operation is performed on the sum so that the updated image is obtained.
 7. A parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes, comprising: a model construction module, which is configured to construct a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model, wherein the model is defined as: $\begin{matrix} {{\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j},f_{j},D} \right)} = {\underset{V,D,X}{\arg\min}\;\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX}_{l}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}}}},} & (1) \end{matrix}$ wherein V denotes a reconstructed image, D∈c^(M×P) denotes an overcomplete (P >>M) dictionary, θdenotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(l,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, F_(M) denotes a Fourier transformation, V₁ denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vectorized size of the image, P denotes a number of atoms, a subscript F denotes the Fourier transformation, λdenotes a data fitting term weight, βdenotes a joint sparse regularization weight, and X_(2,1) denotes a joint sparse term, and wherein ${{X_{l}}_{2,1} = {\sum\limits_{p = 1}^{p}\sqrt{\sum\limits_{j = 1}^{j}X_{l_{p},j}^{2}}}},$  wherein X_(l) _(p) _(,j) ² denotes a p-th pixel for the l-th extracted patch from the j-th channel image; an update module an imaging module, comprising a module for updating the joint sparse codes X, a module for updating the dictionary D, a module for updating the image v_(j) of the each channel, and a module for updating the K-space data f_(j), wherein the module for updating the dictionary D is configured to temporarily fix X, and learn the dictionary D by using a gradient descent method: $\begin{matrix} {{D^{k + 1} = {D^{k} - {\gamma\frac{\partial{\theta(D)}}{\partial(D)}}}},} & (2) \end{matrix}$ wherein γdenotes a learning rate, and k denotes a number of iterations, and wherein $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$  applies, wherein the formula $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$ denotes a reciprocal of the reconstructed objective function to the dictionary D, and H denotes conjugate transpose, and thus the following formula is obtained: D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3); the module for updating the image v_(j) of the each channel is configured to update v_(j) by using the following formula: v j k + 1 = θ ⁡ ( X k + 1 , v j , f j k ) = arg ⁢ min v j ⁢ { λ 2 ⁢ ∑ j = 1 J  F M ⁢ v j - f j  + ∑ l = 1 L ∑ j = 1 J (  R l ⁢ V - D ⁢ X l  F 2 ) } ; ( 4 ) the module for updating the K-space data f is configured to update the K-space data by using the following formula: f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5), wherein f_(j) ^(k) denotes a k-th iterative updated value of the j-th channel; the module for updating the image v_(j) of the each channel is further configured to perform an inverse Fourier transformation on the K-space data and re-update v_(j) to obtain the following formula: v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6); and an imaging module, which is configured to obtain an updated image based on the images v_(j) of the all channels.
 8. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes of claim 7, further comprising an initialization module for initializing X⁰, V₀, f_(j) ⁰.
 9. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes of claim 7, wherein constructing the reconstructed model is solving an 1₂−1_(F)−1_(2,1) minimization objective, wherein the 1₂ norm is a data fitting term, the 1_(F) norm is a sparse representation error, and the 1_(2,1) mixed norm is a joint sparsity constraining across multiple channels.
 10. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes of claim 7, wherein the update module is configured to normalize the atoms while updating the dictionary D so as to avoid atomic scale ambiguity of the dictionary.
 11. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes of claim 7, wherein the module for updating the image v_(j) of the each channel is further configured to: step d1: according to a method of least squares, obtain the following formula: $\begin{matrix} {{{\left( {{\lambda F_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}{DX}_{l,j}^{k + 1}}}}}{{{wherein}{\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}},}} & (7) \end{matrix}$ wherein $\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$  denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations; assuming that patches wrap around at image boundaries, the diagonal entries become all equal ${{\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}} = {{\omega I_{N}} \in R^{N \times N}}};$  specifically, when the overlap stride is 1 for the patches, step d2: by a normalized full-sampling Fourier encoding matrix, transform an image domain into a Fourier domain to obtain the following formula: $\begin{matrix} {{{\left( {{\lambda{FF}_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right){Fv}_{j}} = {{\lambda{FF}_{M}^{H}f_{j}} + {F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}{DX}_{l,j}^{k + 1}}} \right)}}},} & (8) \end{matrix}$ wherein FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix consisting of ones and zeros with ones corresponding to sampled locations in K-space, ω denotes a number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel; step d3: transform the formula in step d2 into: $\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ {\frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {{\eta\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}{\eta + 1},} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix},} \right.} & (9) \end{matrix}$ wherein Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space position k_(x),k_(γ)), and

₀=FF_(M) ^(H)f_(j) denotes a zero-filled K-space measured value of the j-th channel; ηdenotes a small scalar, Ωdenotes a subset of the K-space that has been sampled, ${{\mathbb{F}} = \frac{F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{T}{DX}_{l,j}^{k + 1}}} \right)}{\omega}},{{{{and}\eta} = \frac{\lambda}{\omega}};}$  and step d4: obtain v_(j) by the inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.
 12. The parallel magnetic resonance imaging apparatus based on adaptive joint sparse codes of claim 7, wherein the imaging module is configured to sum up squares of the images v_(j) of the all channels and perform a root operation on the sum to obtain the updated image.
 13. A non-transitory computer-readable medium storing a program executable by a computer to cause the computer to perform a parallel magnetic resonance imaging method based on adaptive joint sparse codes, wherein the method comprises: step a: constructing a calibration-free parallel magnetic resonance imaging model based on joint sparse codes, that is, a reconstructed model, wherein the model is defined as: $\begin{matrix} {{\left\{ {V^{*},D^{*},X^{*}} \right\} = {{\theta\left( {X,v_{j},f_{j},D} \right)} = {\underset{V,D,X}{argmin}\left\{ {{\frac{\lambda}{2}{\sum\limits_{j = 1}^{J}{{{F_{M}v_{j}} - f_{j}}}}} + {\sum\limits_{l = 1}^{L}\left( {{{{R_{l}V} - {DX}_{l}}}_{F}^{2} + {\beta{X_{l}}_{2,1}}} \right)}} \right\}}}},} & (1) \end{matrix}$ wherein V denotes a reconstructed image, D∈c^(M×P) denotes an overcomplete (P >>M) dictionary, θ denotes an objective function, X=(X_(l,1)|X_(l,2) . . . X_(l,j) . . . ,|X_(l,j))∈c^(p×j) denotes a sparse matrix, X_(l,j)∈c^(P) denotes an l-th extracted patch from a j-th channel image, FM denotes a Fourier transformation, v_(j) denotes an image of each channel, V denotes a matrix formed by images v_(j) of all channels, f_(j) denotes K-space data, R_(l)∈c^(M×N) denotes a patch extraction matrix, M denotes an atom size, N denotes a vectorized size of the image, P denotes a number of atoms, a subscript F denotes the Fourier transformation, λdenotes a data fitting term weight, βdenotes a joint sparse regularization weight, and X_(2,1) denotes a joint sparse term, and wherein ${{X_{l}}_{2,1} = {\sum\limits_{p = 1}^{p}\sqrt{\sum\limits_{j = 1}^{j}X_{l_{p},j}^{2}}}},$  wherein X_(l) _(p) _(,j) ² denotes a p-th pixel for the l-th extracted patch from the j-th channel image; step b: temporarily fixing X, and solving the dictionary D by using a gradient descent method: $\begin{matrix} {D^{k + 1} = {D^{k} - {\gamma{\frac{\partial{\theta(D)}}{\partial(D)}.}}}} & (2) \end{matrix}$ wherein γdenotes a learning rate, and k denotes a number of iterations, and wherein $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$  applies, wherein the formula $\frac{\partial{\theta(D)}}{\partial(D)} = {\left( {{DX} - {R_{l}V}} \right)X^{H}}$  denotes a reciprocal of the reconstructed objective function to the dictionary D and H denotes conjugate transpose, and thus the following formula is obtained: D ^(k+1) =D ^(k)−γ(DX−R _(l) V)X ^(H)  (3); step c: updating joint sparse coefficient X; step d: updating v_(j) by using the following formula: v j k + 1 = θ ⁡ ( X k + 1 , v j , f j k ) = arg ⁢ min v j ⁢ { λ 2 ⁢ ∑ j = 1 J  F M ⁢ v j - f j  + ∑ l = 1 L ∑ j = 1 J (  R l ⁢ V - D ⁢ X l  F 2 ) } ; ( 4 ) step e: updating the K-space data by using the following formula: f _(j) ^(k+)1=f _(j) ^(k) +f _(j) −F _(M) v _(j) ^(k+)1  (5), wherein f_(j) ^(k) denotes an updated value of a k-th iteration of the j-th channel; step f: performing an inverse Fourier transformation on the K-space data and re-updating v_(j) to obtain the following formula: v _(j) ^(k+)1=F ^(H) f _(j) ^(k+)1  (6); and step g: obtaining an updated image based on the images v_(j) of the all channels.
 14. The computer-readable medium of claim 13, wherein in step a, constructing the reconstructed model is solving an l₂−l_(F)−l_(2,1) minimization objective, wherein the 1₂ norm is a data fitting term, the 1_(F) norm is a sparse representation error, and the 1_(2,1) mixed norm is a joint sparsity constraining across multiple channels.
 15. The computer-readable medium of claim 13, wherein step a comprises a step of initializing X⁰, V₀, f_(j) ⁰.
 16. The computer-readable medium of claim 13, wherein in step b, the atoms are normalized so that atomic scale ambiguity of the dictionary is avoided.
 17. The computer-readable medium of claim 13, wherein in step d, updating v_(j) further comprises: step d1: according to a least square method, obtaining the following formula: $\begin{matrix} {{{\left( {{\lambda F_{M}^{H}F_{M}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}} \right)v_{j}} = {{\lambda F_{M}^{H}f_{j}} + {\sum\limits_{l = 1}^{L}{R_{l}^{T}{DX}_{l,j}^{k + 1}}}}}{{{wherein}{\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}}},}} & (7) \end{matrix}$ wherein $\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}$  denotes a diagonal matrix and diagonal entries correspond to image pixel locations with their values equal to the number of overlapping patches contributing at those pixel locations, assuming that patches wrap around at the image boundaries, the diagonal entries become all equal ${{\sum\limits_{l = 1}^{L}{R_{l}^{T}R_{l}}} = {{\omega I_{N}} \in R^{N \times N}}},$  specifically, when the overlap stride is 1 for the patches, ω=M; step d2: by a normalized full-sampling Fourier encoding matrix, transforming an image domain into a Fourier domain to obtain the following formula: $\begin{matrix} {{{\left( {{\lambda{FF}_{M}^{H}F_{M}F^{H}} + {\omega I_{N}}} \right){Fv}_{j}} = {{\lambda{FF}_{M}^{H}f_{j}} + {F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{R}{DX}_{l,j}^{k + 1}}} \right)}}},} & (8) \end{matrix}$ wherein FF_(M) ^(H)F_(M)F^(H) denotes a diagonal matrix consisting of ones and zeros with ones corresponding to sampled locations in K-space, ^(ω)denotes a number of repeated pixels, I_(N) denotes a unit matrix of N*N, and λFF_(M) ^(H)f_(j) denotes a zero-filled Fourier measured value of the j-th channel; step d3: transforming the formula in step d2 into: $\begin{matrix} {{{Fv}_{j}\left( {k_{x},k_{y}} \right)} = \left\{ {\begin{matrix} {{\mathbb{F}}\left( {k_{x},k_{y}} \right)} & {\left( {k_{x},k_{y}} \right) \notin \Omega_{j}} \\ {\frac{{{\mathbb{F}}\left( {k_{x},k_{y}} \right)} + {{\eta\mathbb{F}}_{0}\left( {k_{x},k_{y}} \right)}}{\eta + 1},} & {\left( {k_{x},k_{y}} \right) \in \Omega_{j}} \end{matrix},} \right.} & (9) \end{matrix}$ wherein Fv_(j)(k_(x),k_(γ)) denotes an updated value of a K-space position (k_(x),k_(γ)), and

₀=FF_(M) ^(H)f_(j) denotes a zero-filled K-space measured value of the j-th channel; ηdenotes a small scalar, Ωdenotes a subset of the K-space that has been sampled, ${{\mathbb{F}} = \frac{F\left( {\sum\limits_{l = 1}^{L}{R_{l}^{T}{DX}_{l,j}^{k + 1}}} \right)}{\omega}},{{{{and}\eta} = \frac{\lambda}{\omega}};}$  and step d4: obtaining v_(j) by the inverse Fourier transformation according to data in a frequency domain in the formula (9) in step d3.
 18. The computer-readable medium of claim 13, wherein in step g, squares of the images v_(j) of the all channels are summed up and a root operation is performed on the sum so that the updated image is obtained. 